Distance-restricted matching extension in planar triangulations
نویسندگان
چکیده
منابع مشابه
Distance-Restricted Matching Extension in Triangulations on the Torus and the Klein Bottle
A graph G with at least 2m+2 edges is said to be distance d m-extendable if for any matching M of G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching of G containing M . In [J. Graph Theory 67 (2011), no. 1, 38-46], Aldred and Plummer proved that every 5-connected triangulation on the plane or the projective plane with an even order is distance 5...
متن کاملDistance-Restricted Matching Extension in Triangulations of the Torus and the Klein Bottle
A graph G with at least 2m + 2 edges is said to be distance d m-extendable if for any matching M in G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching in G containing M . In a previous paper, Aldred and Plummer proved that every 5-connected triangulation of the plane or the projective plane of even order is distance 5 m-extendable for any m. In ...
متن کاملEdge proximity and matching extension in planar triangulations
Let G be a graph with at least 2(m+ n+1) vertices. Then G is E(m,n) if for each pair of disjoint matchings M,N ⊆ E(G) of size m and n respectively, there exists a perfect matching F in G such that M ⊆ F and F ∩N = ∅. In the present paper we wish to study property E(m,n) for the various values of integers m and n when the graphs in question are restricted to be planar. It is known that no planar...
متن کاملMatching Extension Missing Vertices and Edges in Triangulations of Surfaces
Let G be a 5-connected triangulation of a surface Σ different from the sphere, and let χ = χ(Σ) be the Euler characteristic of Σ. Suppose that V0 ⊆ V (G) with |V (G) − V0| even and M and N are two matchings in G − V0 of sizes m and n respectively such that M ∩ N = ∅. It is shown that if the pairwise distance between any two elements of V0 ∪ M ∪ N is at least 5 and the face-width of the embeddin...
متن کاملRotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry
In a beautiful paper, Sleator, Tarjan and Thurston solved the problem of maximum rotation distance of two binary trees. Equivalently they solved the problem of rotation distance of triangulations on the disk. We extend their results to rotation distance of triangulations of other planar surfaces. We give upper and lower bounds for this problem. Equivalently, by duality, one can interpret our re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.03.027